The Number of Depth - First Searches of an Ordered Set
نویسنده
چکیده
We show that the problems of deciding whether an ordered set has at least k depth-first linear extensions and whether an ordered set has at least k greedy linear extensions are NP-hard. AMS subject chssi6catiom (1980). 06A10, 68C25.
منابع مشابه
Convex $L$-lattice subgroups in $L$-ordered groups
In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...
متن کاملThe 2-dimension of a Tree
Let $x$ and $y$ be two distinct vertices in a connected graph $G$. The $x,y$-location of a vertex $w$ is the ordered pair of distances from $w$ to $x$ and $y$, that is, the ordered pair $(d(x,w), d(y,w))$. A set of vertices $W$ in $G$ is $x,y$-located if any two vertices in $W$ have distinct $x,y$-location.A set $W$ of vertices in $G$ is 2-located if it is $x,y$-located, for some distinct...
متن کاملRestricting the parameter set of the Pascoletti-Serafini scalarization
A common approach to determine efficient solutions of a multiple objective optimization problem is reformulating it to a parameter dependent scalar optimization problem. This reformulation is called scalarization approach. Here, a well-known scalarization approach named Pascoletti-Serafini scalarization is considered. First, some difficulties of this scalarization are discussed and then ...
متن کاملORDERED INTUITIONISTIC FUZZY SOFT MODEL OF FLOOD ALARM
A flood warning system is a non-structural measure for flood mitigation. Several parameters are responsible for flood related disasters. This work illustrates an ordered intuitionistic fuzzy analysis that has the capability to simulate the unknown relations between a set of meteorological and hydrological parameters. In this paper, we first define ordered intuitionistic fuzzy soft sets and est...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کامل